Quantifying tag representativeness of visual content of social images.

Affinity%2Ddriven prediction and ranking of products in online product review sites.

Efficient Database%2DDriven Evaluation of Security Clearance for Federated Access Control of Dynamic XML Documents.
Abstract. Achieving data security over cooperating web services is becoming a reality, but existing XML access control architectures do not consider this federated service computing. In this paper, we consider a federated access control model, in which Data Provider and Policy Enforcers are separated into different organizations; the Data Provider is responsible for evaluating criticality of requested XML documents based on co-occurrence of security objects, and issuing security clearances. The Policy Enforcers enforce access control rules reflecting their organization-specific policies. A user’s query is sent to the Data Provider and she needs to obtain a permission from the Policy Enforcer in her organization to read the results of her query. The Data Provider evaluates the query and also evaluate criticality of the query, where evaluation of sensitiveness is carried out by using clearance rules. In this setting, we present a novel approach, called the DIFF approach, to evaluate security clearance by the Data Provider. Our technique is build on top of relational framework and utilizes pre-evaluated clearances by taking the differences (or deltas) between query results. 1


XMorph A shape%2Dpolymorphic%2C domain%2Dspecific XML data transformation language.

The Steady States and Dynamics of Urokinase%2Dmediated Plasmin Activation.

GBLENDER towards blending visual query formulation and query processing in graph databases.

GBLENDER towards blending visual query formulation and query processing in graph databases.

Using XMorph to Transform XML Data.
XMorph is a new, shape polymorphic, domain-specific XML query language. A query in a shape polymorphic language adapts to the shape of the input, freeing the user from having to know the input’s shape and making the query applicable to a wide variety of differently shaped inputs. An XMorph query specifies the shape of the output. The XMorph query engine transforms the input to the desired shape by shredding an XML document to a graph of closest relationships, and performing a closeness preserving transformation. We plan to demonstrate XMorph using a Java applet, which can also be used by the audience during the demonstration, to evaluate various XMorph queries. The applet will show the output, the shapes generated by the query, and report on potential data loss in a transformation. 1.
iAVATAR An Interactive Tool for Finding and Visualizing Visual%2DRepresentative Tags in Image Search.
Tags associated with social images are valuable information source for superior image search and retrieval experiences. Due to the nature of tagging, many tags associated with images are not visually descriptive. Consequently, presence of these noisy tags may reduce the effectiveness of tags ’ role in image retrieval. To address this problem, we demonstrate iAVATAR (interActive VisuAlrepresentative TAgs Relationship) system that uses the notion of Normalized Image Tag Clarity (NITC) to find visual-representative tags. A visual-representative tag effectively describes the visual content of the images. Further, we visually demonstrate relationships between popular tags and visual-representative tags as well as co-occurrence likelihood of a pair of tags associated with a search tag or image using tag relationship graph (TRG). We demonstrate various innovative features of iAVATAR with a real-world dataset and show that it enriches users ’ understanding of various important tag features during image search. 1.
Database and Expert Systems Applications

Blog cascade affinity analysis and prediction.

Towards non%2Ddirectional Xpath evaluation in a RDBMS.

On the Discovery of Conserved XML Query Patterns for Evolution%2DConscious Caching.

In the Search of NECTARs from Evolutionary Trees.

XBLEND Visual XML Query Formulation Meets Query Processing.

COWES Web user clustering based on evolutionary web sessions.

NEAR%2DMiner Mining Evolution Associations of Web Site Directories for Efficient Maintenance of Web Archives.
Web archives preserve the history of autonomous Web sites and are potential gold mines for all kinds of media and business analysts. The most common Web archiving technique uses crawlers to automate the process of collecting Web pages. However, (re)downloading entire collection of pages periodically from a large Web site is unfeasible. In this paper, we take a step towards addressing this problem. We devise a data mining-driven policy for selectively (re)downloading Web pages that are located in hierarchical directory structures which are believed to have changed significantly (e.g., a substantial percentage of pages are inserted to/removed from the directory). Consequently, there is no need to download and maintain pages that have not changed since the last crawl as they can be easily retrieved from the archive. In our approach, we propose an off-line data mining algorithm called near-Miner that analyzes the evolution history of Web directory structures of the original Web site stored in the archive and mines negatively correlated association rules (near) between ancestor-descendant Web directories. These rules indicate the evolution correlations between Web directories. Using the discovered rules, we propose an efficient Web archive maintenance algorithm called warm that optimally skips the subdirectories (during the next crawl) which are negatively correlated with it in undergoing significant changes. Our experimental results with real data show that our approach improves the efficiency of the archive maintenance process significantly while sacrificing slightly in keeping the “freshness ” of the archives. Furthermore, our experiments demonstrate that it is not necessary to discover nears frequently as the mining rules can be utilized effectively for archive maintenance over multiple versions.
Database and Expert Systems Applications

Characterizing and predicting community members from evolutionary and heterogeneous networks.

XML Data Integration Based on Content and Structure Similarity Using Keys.

Efficient evaluation of high%2Dselective xml twig patterns with parent child edges in tree%2Dunaware rdbms.

Schema and web data management.
Abstract. Indices and data structures for web querying have mostly considered tree shaped data, reflecting the view of XML documents as tree-shaped. However, for RDF (and when querying ID/IDREF constraints in XML) data is indisputably graph-shaped. In this chapter, we first study existing indexing and labeling schemes for RDF and graph data in general with focus on support for efficient adjacency and reachability queries. For XML, labeling schemes are an important part of the widespread adoption of XML, in particular for mapping XML to existing (relational) database technology. However, the existing indexing and labeling schemes for RDF (and graph data in general) sacrifice one of the most attractive properties of XML labeling schemes, the constant time (and per-node space) test for adjacency (child) and reachability (descendant). In the second part, we introduce the first labeling scheme for RDF data that retains this property and thus achieves linear time and space processing of acyclic RDF queries on a significantly larger class of graphs than previous approaches (which are mostly limited to tree-shaped data). Finally, we show how this labeling scheme can be applied to
An XML Schema integration and query mechanism system.

Efficient evaluation of high%2Dselective xml twig patterns with parent child edges in tree%2Dunaware rdbms.

BioDIFF An Effective Fast Change Detection Algorithm for Biological Annotations.

Efficient Support for Ordered XPath Processing in Tree%2DUnaware Commercial Relational Databases.

Efficient XML Query Processing in RDBMS Using GUI%2DDriven Prefetching in a Single%2DUser Environment.

Efficient Evaluation of Nearest Common Ancestor in XML Twig Queries Using Tree%2DUnaware RDBMS.

XANADUE a system for detecting changes to XML data in tree%2Dunaware relational databases.

Mirror site maintenance based on evolution associations of web directories.

Web Data and Schema Management.

DTD%2DDiff A change detection algorithm for DTDs.

Mapping%2C indexing and querying of MPEG%2D7 descriptors in RDBMS with IXMDB.

A transaction model and multiversion concurrency control for mobile database systems.

Efficient processing of XPath queries using indexes.

COWES Clustering Web Users Based on Historical Web Sessions.
Abstract. Clustering web users is one of the most important research topics in web usage mining. Existing approaches cluster web users based on the snapshots of web user sessions. They do not take into account the dynamic nature of web usage data. In this paper, we focus on discovering novel knowledge by clustering web users based on the evolutions of their historical web sessions. We present an algorithm called COWES to cluster web users in three steps. First, given a set of web users, we mine the history of their web sessions to extract interesting patterns that capture the characteristics of their usage data evolution. Then, the similarity between web users is computed based on their common interesting patterns. Then, the desired clusters are generated by a partitioning clustering technique. Web user clusters generated based on their historical web sessions are useful in intelligent web advertisement and web caching. 1
DTD%2DDiff A Change Detection Algorithm for DTDs.

A Tale of Two Approaches Query Performance Study of XML Storage Strategies in Relational Databases.

Every Click You Make

PRIVATE%2DIYE A Framework for Privacy Preserving Data Integration.

Event detection from evolution of click%2Dthrough data.
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose the first approach to detect events from the click-through data, which is the log data of web search engines. The intuition behind event detection from click-through data is that such data is often event-driven and each event can be represented as a set of query-page pairs that are not only semantically similar but also have similar evolution pattern over time. Given the click-through data, in our proposed approach, we first segment it into a sequence of bipartite graphs based on the user-defined time granularity. Next, the sequence of bipartite graphs is represented as a vectorbased graph, which records the semantic and evolutionary relationships between queries and pages. After that, the vector-based graph is transformed into its dual graph, where each node is a query-page pair that will be used to represent real world events. Then, the problem of event detection is equivalent to the problem of clustering the dual graph of the vector-based graph. The clustering process is based on a two-phase graph cut algorithm. In the first phase, querypage pairs are clustered based on the semantic-based similarity such that each cluster in the result corresponds to a specific topic. In the second phase, query-page pairs related to the same topic are further clustered based on the evolution pattern-based similarity such that each cluster is expected to represent a specific event under the specific topic. Experiments with real click-through data collected from a commercial web search engine show that the proposed approach produces high quality results.
Cleopatra Evolutionary Pattern%2DBased Clustering of Web Usage Data.

iWed An Integrated Multigraph Cut%2DBased Approach for Detecting Events from a Website.


Mining Temporal Indirect Associations.


Research Issues in Web Structural Delta Mining.
Web structure mining has been a well-researched area during recent years. However, we observed that data on the web is changing at any time in any way, even though there are some incremental data mining algorithms that are proposed to update the mining results with the corresponding changes, none of the existing web structure mining techniques is able to extract useful and hidden knowledge from the sequence of historical web structural changes. In this paper, we proposed a novel research area of web structure mining named web structural delta mining. The distinct feature of our research is that our mining object is the sequence of historical changes of web structure (Web Structural Deltas). For web structural delta mining, we aim to extract useful, interesting, and novel web structures and knowledge considering their historical, dynamic, and temporal properties. We proposed three major issues of web structural delta mining, identify useful and interesting structures, extract association from changes of web structure, and cluster web structure based on patterns of changes. Also, the challenges of web structural delta mining corresponding to different issues are discussed in this paper.

Efficient recursive XML query processing using relational database systems.

FRACTURE mining Mining frequently and concurrently mutating structures from historical XML documents.


XML structural delta mining Issues and challenges.
we observed that most of the existing works are based on the characteristics obtained from the snapshots of XML data, while XML data is dynamic in real life applications. In this paper, we propose a novel research topic namely XML structural delta mining. The idea of XML structural delta mining is to discover knowledge from sequences of structural changes to XML documents, which is also called XML structural delta. The distinct feature of XML structural delta mining is that it is based on the dynamic and temporal characteristics obtained from the historical versions of XML documents. The proposed XML structural delta mining aims to extract novel knowledge from the sequence of XML structural deltas. Such knowledge can be useful in many applications such as change detection for very large XML documents, e#cient XML indexing, and XML search engine etc. In this paper, we present three major issues of XML structural delta mining, identifying various interesting structures, discovering association rules from structural deltas, and structural change pattern based classification. The challenges for conducting such XML structural delta mining tasks are also discussed.
Mining conserved XML query paths for dynamic%2Dconscious caching.
on extracting the set of frequently issued query pattern trees based on the number of occurrences of the query pattern trees in the history. Each occurrence of the same query pattern tree is considered equally important for the caching strategy. However, the same query pattern tree may occur at di#erent timepoints in the history of XML queries. This temporal feature can be used to improve the caching strategy. In this paper, we propose a novel type of query pattern called conserved query paths for e#cient caching by integrating the support and temporal features together. Conserved query paths are paths in query pattern trees that never change or do not change significantly most of the time (if not always) in terms of their support values during a specific time period. We proposed an algorithm to extract those conserved query paths. By ranking those conserved query paths, a dynamic-conscious caching (DCC) strategy is proposed for e#cient XML query processing. Experiments show that the DCC caching strategy outperforms the existing XML query pattern tree-based caching strategies.
WAM%2DMiner in the search of web access motifs from historical web log data.
Existing web usage mining techniques focus only on discovering knowledge based on the statistical measures obtained from the static characteristics of web usage data. They do not consider the dynamic nature of web usage data. In this paper, we focus on discovering novel knowledge by analyzing the change patterns of historical web access sequence data. We present an algorithm called Wam-Miner to discover Web Access Motifs (WAMs). WAMs are web access patterns that never change or do not change significantly most of the time (if not always) in terms of their support values during a specific time period. WAMs are useful for many applications, such as intelligent web advertisement, web site restructuring, business intelligence, and intelligent web caching.
Detecting changes on unordered XML documents using relational databases a schema%2Dconscious approach.

Xandy Detecting Changes on Large Unordered XML Documents Using Relational Databases.

Xandy Detecting Changes on Large Unordered XML Documents Using Relational Databases.

FASST Mining Discovering Frequently Changing Semantic Structure from Versions of Unordered XML Documents.
Abstract. In this paper, we present a FASST mining approach to extract the frequently changing semantic structures (FASSTs), which are a subset of semantic substructures that change frequently, from versions of unordered XML documents. We propose a data structure, H-DOM +, and a FASST mining algorithm, which incorporates the semantic issue and takes the advantage of the related domain knowledge. The distinct feature of this approach is that the FASST mining process is guided by the user-defined concept hierarchy. Rather than mining all the frequent changing structures, only these frequent changing structures that are semantically meaningful are extracted. Our experimental results show that the H-DOM + structure is compact and the FASST algorithm is efficient with good scalability. We also design a declarative FASST query language, FASSTQUEL, to make the FASST mining process interactive and flexible. 1
Mining Positive and Negative Association Rules from XML Query Patterns for Caching.

SM3  An XML Database Solution for the Management of MPEG%2D7 Descriptions.

Detecting Semantically Correct Changes to Relevant Unordered Hidden Web Data.

Event Composition and Detection in Data Stream Management Systems.

Detecting Changes to Hybrid XML Documents Using Relational Databases.

Event Composition and Detection in Data Stream Management Systems.

Bio2X a rule%2Dbased approach for semi%2Dautomatic transformation of semi%2Dstructured biological data to XML.

DEQUE querying the deep web.

Biological Data Management %28BIDM 2003%29.

HW%2DSTALKER A machine learning%2Dbased system for transforming QURE%2DPagelets to XML.

BioDIFF an effective fast change detection algorithm for genomic and proteomic data.

Discovering frequently changing structures from historical structural deltas of unordered XML.
Recently, a large amount of work has been done in XML data mining. However, we observed that most of the existing works focus on the snapshot XML data, while XML data is dynamic in real applications. To the best of our knowledge, none of the existing works has addressed the issue of mining the history of changes to XML documents. Such mining results can be useful in many applications such as XML change detection, XML indexing, association rule mining, and classification etc. In this paper, we propose a novel approach to discover the frequently changing structures from the sequence of historical structural deltas of unordered XML. To make the structure discovering process e#cient, an expressive and compact data model, Historical-Document Object Model (H-DOM), is proposed. Using this model, two basic algorithms, which can discover all the frequently changing structures with only two scans of the XML sequence, are presented. Experimental results show that our algorithms, together with the optimization techniques, are e#cient and scalable.
A Global%2Dto%2DLocal Rewriting Querying Mechanism Using Semantic Mapping for XML Schema Integration.

DiffXML Change Detection in XML Data.

SUCXENT An Efficient Path%2DBased Approach to Store and Query XML Documents.

Detecting Content Changes on Ordered XML Documents Using Relational Databases.

HW%2DSTALKER A Machine Learning%2DBased Approach to Transform Hidden Web Data to XML.

Mining Maximal Frequently Changing Subtree Patterns from XML Documents.

Discovering Pattern%2DBased Dynamic Structures from Versions of Unordered XML Documents.

Efficient Recursive XML Query Processing in Relational Database Systems.

Looking at mapping

VRules an effective association%2Dbased classifier for videos.

Mining Association Rules from Structural Deltas of Historical XML Documents.

Mining History of Changes to Web Access Patterns.
Qiankun Zhao Sourav S. Bhowmick  Nanyang Technological University Singapore, 639798  {pg04327224,assourav}@ntu.edu.sg  1 
HyperThesis the gRNA spell on the curse of bioinformatics applications integration.
In this paper, we describe a graphical workflow management system called HyperThesis to address the challenges of integrating bioinformatics applications. HyperThesis is an integral component of the Genomics Research Network Architecture (gRNA). The gRNA was designed and developed to address the challenges of developing new bioinformatics applications. Specifically, HyperThesis makes constructing workflows (pipelines of execution of applications) in the gRNA fast and intuitive for biologists and bio-programmers alike. It provides a large repository of interconnectable, parameterized workflow components for processing and relating diverse biological data and software programs. It also enables us to add new workflow components as new algorithms develop in ones area of interest. HyperThesis has been fully implemented using Java.
Incremental Query Answering Using a Multi%2Dlayered Database Model in a Mobile Computing Environment.

Data Management in Metaboloinformatics Issues and Challenges.


Modelling and Predicting Web Page Accesses Using Markov Processes.


AXIS A XML Schema Integration System.

VACXENE A User%2DFriendly Visual Synthetic XML Generator.

XomatiQ Living With Genomes%2C Proteomes%2C Relations and a Little Bit of XML.

A Multi%2Dlayered Database Model for Mobile Environment.

Representation of Web Data in A Web Warehouse.

Constraint%2Ddriven join processing in a Web Warehouse.

Constraint%2Ddriven join processing in a Web Warehouse.

Formulating disjunctive coupling queries in a web warehouse.

Deriving and verifying statistical distribution of a hyperlink%2Dbased Web page quality metric.

Detecting and Representing Relevant Web Deltas in WHOWEDA.
In this paper, we present a mechanism for detecting and representing changes given the old and new versions of a set of interlinked Web documents, retrieved in response to a user’s query. In particular, we show how to detect and represent web deltas, i.e., changes in the Web documents that are relevant to a user’s query in the context of our web warehousing system called Whoweda (W arehouse of Web Data). In Whoweda, Web information are materialized views stored in web tables in the form of web tuples. These web tuples, represented as directed graphs, can be manipulated using a set of web algebraic operators. In this paper, we present a mechanism to detect relevant web deltas using web algebraic operators such as the web join and the outer web join. Web join is used to detect identical documents residing in two web tables whereas outer web join, a derivative of web join is used to identify dangling web tuples. We show how to represent these changes using delta web tables. We develop formal algorithms for the generation of delta web tables identifying web documents which have been added, deleted or modified since the last query.
A Multi%2Dversion Transaction Model to Improve Data Availability in Mobile Computing.

Deriving and Verifying Statistical Distribution of a Hyperlink%2DBased Web Page Quality Metric.

Efficient Processing of XPath Queries Using Indexes.

Modelling and Predicting Web Page Accesses Using Burrell%27s Model.

Web Informetrics Extending Classical Informetrics to the Web.

Controlling Web Query Execution in a Web Warehouse.

Constraint%2DFree Join Processing on Hyperlinked Web Data.

Modelling and Predicting Web Page Accesses Using Burrell%27s Model.

A Model for XML Schema Integration.

The gRNA A Highly Programmable Infrastructure for Prototyping
The evolving challenges in lifesciences research  cannot be all addressed by off-the-shelf bioinformatics  applications. Life scientists need  to analyze their data using novel or contextsensitive  approaches that might be published  in recent journals and publications, or based  on their own hypotheses and assumptions.
Ranking of Web Data in a Web Warehouse.

A survey of Web metrics.
... this article, we examine this issue by classifying and discussing a wide  ranging set of Web metrics. We present the origins, measurement functions,  formulations and comparisons of well-known Web metrics for quantifying Web graph  properties, Web page significance, Web page similarity, search and retrieval, usage  characterization and information theoretic properties. We also discuss how these metrics  can be applied for improving Web information access and use.
What can a web bag discover for you%3F

Mobile data and transaction management.

Anatomy of the coupling query in a web warehouse.

On Formulation of Disjunctive Coupling Queries in WHOWEDA.

Imposing Disjunctive Constraints on Inter%2Ddocument Structure.

Schemas for web data a reverse engineering approach.

Web Schemas in WHOMEDA.

Association Rules for Web Data Mining in WHOWEDA.

Detecting and Representing Relevant Web Deltas using Web Join.

Reducing Cognitive Overheads in a Web Warehouse Using Reverse%2DOsmosis.

Association Rules for Web Data Mining in WHOWEDA.

An Architecture for XML Schema Integration.

Data Visualization Operators for WHOWEDA.

Cost%2Dbenefit analysis of web bag in a web warehouse An analytical approach.

Pi%2DWeb Join in a Web Warehouse.

Research Issues in Web Data Mining.

Algebraic Operations on Bags in a Web Warehouse.

Cost%2DBenefit Analysis of Web Bag in a Web Warehouse.

Web Warehousing An Algebra for Web Information.
While conventional keyword indexes maintained by web search engines such as Yahoo, Lycos, and World Wide Web Worm work well for most simple keyword searches, they are inadequate when more complex and structured queries involving the underlying hypertext structure of the World Wide Web are desired. Building from a database perspective, existing work to support such queries focuses on constructing SQL-like query languages for the WWW that assumes a relational abstraction of the WWW. Nonetheless, the WWW is a directed graph and imposing a relational abstraction filters out its inherent topological structure. In this paper, we propose a data model for the WWW that retains its topological structure and construct a web algebra to manipulate objects in this model. The web algebra establishes a formal foundation from which different web query languages can be designed. 1 Introduction  From a user&#039;s perspective, the World Wide Web is a broadcast medium where a wide range of up-to-date informati...
Join Processing in Web Databases.
. Recently, there has been increasing interests in data models and query languages for unstructured data in the World Wide Web. When web data is harnessed in a web warehouse, new and useful information can be derived through appropriate information manipulation. In our web warehousing project, we introduce a new operator called the web join. Like its relational counterpart, web join combines information from two web tables to yield a new web table. This paper discusses various issues in web join such as join semantics, joinability, and join evaluation. 1 Introduction  Given the high rate of growth of the volume of data available on the WWW, locating information of interest in such an anarchic setting becomes a more difficult process everyday. Thus, there is the recognition of the undeferring need for effective and efficient tools for information consumers, who must be able to easily locate and manipulate information in the Web. We aim to build a web warehouse containing information ext...
Information Coupling in Web Databases.
Web information coupling refers to an association of topically related web documents. This coupling is initiated explicitly by a user in a web warehouse specially designed for web information. Web information coupling provides the means to derive additional, useful information from the WWW. In this paper, we discuss and show how two web operators, i.e., global web coupling and local web coupling , are used to associate related web information from the WWW and also from multiple web tables in a web warehouse. This paper discusses various issues in web coupling such as coupling semantics, coupling-compability, and coupling evaluation. 1 Introduction  Given the high rate of growth of the volume of data available on the WWW, locating information of interest in such an anarchic setting becomes a more difficult task everyday. Thus, there is the recognition of the undeferring need for effective and efficient tools for information consumers, who must be able to easily locate and manipulate inf...
Data Visualization in a Web Warehouse.

Web Warehousing Design and Issues.

Web Bags %2D Are They Useful in A Web Warehouse%3F
Sets and bags are closely related structures. A bag is different from a set in that it is sensitive to the number of times an element occurs while a set is not. In this paper, we introduce the concept of web bag in a web warehouse as a part of our  Web Information Coupling System(WICS). Informally, a web bag is a web table  which allows multiple occurrences of identical web tuples. Web bag helps to discover useful knowledge from a web table such as visible documents (or web sites), luminous  documents and luminous paths. We formally discuss the semantics and properties of web bags, and illustrate with examples applications of web bag in knowledge discovery in a web warehouse. 1 Introduction  Sets and bags are closely related structures. When a set is allowed to have multiple occurrences of a member, it is called a bag or multi-set [29]. While a set of tuples (i.e., a relation) is a simple, natural model of data as it might appear in a database, commercial systems are rarely if ever bas...
